Selected inversion as key to a stable Langevin evolution across the QCD phase boundary

We present new results of full QCD at nonzero chemical potential. In PRD 92, 094516 (2015) the complex Langevin method was shown to break down when the inverse coupling decreases and enters the transition region from the deconfined to the confined phase. We found that the stochastic technique used to estimate the drift term can be very unstable for indefinite matrices. This may be avoided by using the full inverse of the Dirac operator, which is, however, too costly for four-dimensional lattices. The major breakthrough in this work was achieved by realizing that the inverse elements necessary for the drift term can be computed efficiently using the selected inversion technique provided by the parallel sparse direct solver package PARDISO. In our new study we show that no breakdown of the complex Langevin method is encountered and that simulations can be performed across the phase boundary.Comment: 8 pages, 6 figures, Proceedings of the 35th International Symposium on Lattice Field Theory, Granada, Spai

Evading the sign problem in random matrix simulations

We show how the sign problem occurring in dynamical simulations of random matrices at nonzero chemical potential can be avoided by judiciously combining matrices into subsets. For each subset the sum of fermionic determinants is real and positive such that importance sampling can be used in Monte Carlo simulations. The number of matrices per subset is proportional to the matrix dimension. We measure the chiral condensate and observe that the statistical error is independent of the chemical potential and grows linearly with the matrix dimension, which contrasts strongly with its exponential growth in reweighting methods.Comment: 4 pages, 3 figures, minor corrections, as published in Phys. Rev. Let

Reweighted complex Langevin and its application to two-dimensional QCD

We present the reweighted complex Langevin method, which enlarges the applicability range of the complex Langevin method by reweighting the complex trajectories. In this reweighting procedure both the auxiliary and target ensembles have a complex action. We validate the method by applying it to two-dimensional strong-coupling QCD at nonzero chemical potential, and observe that it gives access to parameter regions that could otherwise not be reached with the complex Langevin method.Comment: 7 pages, 3 figures, Proceedings of the 34th International Symposium on Lattice Field Theory, Southampton, U

Sign problem and subsets in one-dimensional QCD

We present a subset method that solves the sign problem for QCD at nonzero quark chemical potential in 0+1 dimensions. The subsets of gauge configurations are constructed using the center symmetry of the SU(3) group. These subsets completely solve the sign problem for up to five flavors. For a larger number of flavors the sign problem slowly reappears, and we propose an extension of the subsets that also solves the sign problem for these cases. The subset method allows for numerical simulations of the model at nonzero chemical potential. We also present some preliminary results on subsets for QCD in two, three, and four dimensions.Comment: 7 pages, 3 figures, presented at the 31st International Symposium on Lattice Field Theory (Lattice 2013), 29 July - 3 August 2013, Mainz, Germany; one reference added, Table 1 update

A nested Krylov subspace method to compute the sign function of large complex matrices

We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the overlap Dirac operator at both zero and nonzero baryon density. Krylov-Ritz methods approximate the sign function using a projection on a Krylov subspace. To achieve a high accuracy this subspace must be taken quite large, which makes the method too costly. The new idea is to make a further projection on an even smaller, nested Krylov subspace. If additionally an intermediate preconditioning step is applied, this projection can be performed without affecting the accuracy of the approximation, and a substantial gain in efficiency is achieved for both Hermitian and non-Hermitian matrices. The numerical efficiency of the method is demonstrated on lattice configurations of sizes ranging from 4^4 to 10^4, and the new results are compared with those obtained with rational approximation methods.Comment: 17 pages, 12 figures, minor corrections, extended analysis of the preconditioning ste

Progress on Complex Langevin simulations of a finite density matrix model for QCD

We study the Stephanov model, which is an RMT model for QCD at finite density, using the Complex Langevin algorithm. Naive implementation of the algorithm shows convergence towards the phase quenched or quenched theory rather than to intended theory with dynamical quarks. A detailed analysis of this issue and a potential resolution of the failure of this algorithm are discussed. We study the effect of gauge cooling on the Dirac eigenvalue distribution and time evolution of the norm for various cooling norms, which were specifically designed to remove the pathologies of the complex Langevin evolution. The cooling is further supplemented with a shifted representation for the random matrices. Unfortunately, none of these modifications generate a substantial improvement on the complex Langevin evolution and the final results still do not agree with the analytical predictions.Comment: 8 pages, 7 figures, Proceedings of the 35th International Symposium on Lattice Field Theory, Granada, Spai